Metaheuristics for Vehicle Routing Problems by Labadie Nacima & Prins Christian & Prodhon Caroline

Author:Labadie, Nacima & Prins, Christian & Prodhon, Caroline
Language: eng
Format: epub
ISBN: 9781119136781
Publisher: Wiley
Published: 2016-02-11T00:00:00+00:00

4.4.2. ACO in vehicle routing problems

For vehicle routing problems, an ant can, for example, build successive routes on the graph, using for instance a nearest-neighbor heuristic completed by pheromone deposits.

ACO was applied to the CVRP by Bullnheimer et al. [BUL 99], Bell and McMullen [BEL 04], Doerner et al. [DOE 04], Reimann et al. [REI 04] and Yu et al. [YU 09, YU 11a, YU 11b]. For the CARP, Santos et al. proposed an ACO enhanced with a local search, currently one of the best metaheuristics for the CARP [SAN 10]. Ting and Chen [TIN 13] also proposed a multiple ACO to solve the location routing problem (LRP). The method was effective and able to improve several best-known solutions.

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.